Distributed synthesis is simply undecidable

Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable

In this paper, the synthesis of bounded Petri nets from deterministic modal transition systems is shown to be undecidable. The proof is built from three components. First, it is shown that the problem of synthesising bounded Petri nets satisfying a given formula of the conjunctive nucalculus (a suitable fragment of the mu-calculus) is undecidable. Then, an equivalence between deterministic moda...

System NEL is Undecidable

System NEL is a conservative extension of multiplicative exponential linear logic (extended by the rules mix and nullary mix) by a self-dual noncommutative connective called seq which has an intermediate position between the connectives par and times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is simple, the proof o...

Rigidity is undecidable

We show that the problem ‘whether a finite set of regular-linear axioms defines a rigid theory’ is undecidable. 2010 Mathematical Subject Classification 03D35, 03C05, 03G30, 18C10, 18C15

Quasi-Linearizability is Undecidable

Quasi-linearizability is a quantitative relaxation of linearizability. It preserves the intuition of the standard notion of linearizability and permits more flexibility. The decidability of quasi-linearizability has been remaining open in general for a bounded number of processes. In this paper we show that the problem of whether a library is quasilinearizable with respect to a regular sequenti...

Whitehead's Problem is Undecidable